Customer-Server Population Dynamics in Heavy Traffic
نویسندگان
چکیده
We study a many-server queueing model with server vacations, where the population size dynamics of servers and customers are coupled: may leave for vacation only when no await, capacity available to is directly affected by number on vacation. focus scaling regimes in which queue fluctuate at matching time scales so that their limiting coupled. Specifically, we argue interesting coupled occur (a) Halfin–Whitt regime, (b) nondegenerate slowdown (c) intermediate near whereas asymptotically decouple other heavy-traffic regimes. characterize dynamics, different each regime. consider relevant respective performance measures (b)—namely, probability wait slowdown. Although closed-form formulas these have been derived models do not accommodate it difficult obtain setting vacations. Instead, propose approximate depend steady-state mean previously without test accuracy numerically.
منابع مشابه
On many-server queues in heavy traffic
We establish a heavy-traffic limit theorem on convergence in distribution for the number of customers in a many-server queue.
متن کاملA Heavy Traffic Approximation for Queues with Restricted Customer-Server Matchings
We consider a queueing system with n customer classes and m servers. For each class i there is only a subset S(i) of servers that are able to process customer’ i requests and they do that using a first-come-first-serve discipline. For this system, we are primarily interested in computing Pij , the steady-state fraction of class-i customers that are served by server j. We also look at stability ...
متن کاملHeavy-Traffic Limits for Loss Proportions in Single-Server Queues
We establish heavy-traffic stochastic-process limits for the queue-length and overflow stochastic processes in the standard single-server queue with finite waiting room (G/G/1/K). We show that, under regularity conditions, the content and overflow processes in related single-server models with finite waiting room, such as the finite dam, satisfy the same heavy-traffic stochastic-process limits....
متن کاملHeavy traffic resource pooling in parallel-server systems
We consider a queueing system with r non-identical servers working in parallel, exogenous arrivals into m different job classes, and linear holding costs for each class. Each arrival requires a single service, which may be provided by any of several different servers in our general formulation; the service time distribution depends on both the job class being processed and the server selected. ...
متن کاملHeavy-traffic fluid limits for periodic infinite-server queues
To better understand what stochastic model might be appropriate in applications with system data, we study the consequences of fitting a stationary birthand-death (BD) process to the sample path of a periodic Mt/GI/∞model. The fitted BD process will necessarily have the correct steady-state distribution (appropriately defined), but will not have the correct transient behavior. Nevertheless, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic systems
سال: 2022
ISSN: ['1946-5238']
DOI: https://doi.org/10.1287/stsy.2021.0079